Packing cycles with modularity constraints
نویسندگان
چکیده
منابع مشابه
Packing cycles with modularity constraints
We prove that for all positive integers k, there exists an integer N = N(k) such that the following holds. Let G be a graph and let Γ an abelian group with no element of order two. Let γ : E(G)→ Γ be a function mapping elements of Γ to the edges of G. A non-zero cycle is a cycle C such that ∑ e∈E(C) γ(e) 6= 0 where 0 is the identity element of Γ. Then G either contains k vertex disjoint non-zer...
متن کاملMaximal Packing with Interference Constraints
In this work, we study the problem of scheduling a maximal set of transmitters subjected to an interference constraint across all the nodes. Given a set of nodes, the problem reduces to finding the maximum cardinality of a subset of nodes that can concurrently transmit without violating interference constraints. The resulting packing problem is a binary optimization problem and is NP hard. We p...
متن کاملPacking Hamilton Cycles Online
It is known that w.h.p. the hitting time τ2σ for the random graph process to have minimum degree 2σ coincides with the hitting time for σ edge disjoint Hamilton cycles, [4], [13], [9]. In this paper we prove an online version of this property. We show that, for a fixed integer σ ≥ 2, if random edges of Kn are presented one by one then w.h.p. it is possible to color the edges online with σ color...
متن کاملPacking Directed Cycles Efficiently
Let G be a simple digraph. The dicycle packing number of G, denoted νc(G), is the maximum size of a set of arc-disjoint directed cycles in G. Let G be a digraph with a nonnegative arcweight function w. A function ψ from the set C of directed cycles in G to R+ is a fractional dicycle packing of G if ∑ e∈C∈C ψ(C) ≤ w(e) for each e ∈ E(G). The fractional dicycle packing number, denoted ν c (G,w), ...
متن کاملDisjoint Even Cycles Packing
We generalize the well-known theorem of Corrádi and Hajnal which says that if a given graph G has at least 3k vertices and the minimum degree of G is at least 2k, then G contains k vertex-disjoint cycles. Our main result is the following; for any integer k, there is an absolute constant ck satisfying the following; let G be a graph with at least ck vertices such that the minimum degree of G is ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Combinatorica
سال: 2011
ISSN: 0209-9683,1439-6912
DOI: 10.1007/s00493-011-2551-5